minimax search

minimax search
= min-max search
минимаксный поиск
см. тж. minimax, search

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужна курсовая?

Смотреть что такое "minimax search" в других словарях:

  • Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… …   Wikipedia

  • Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… …   Wikipedia

  • Golden section search — The golden section search is a technique for finding the extremum (minimum or maximum) of a unimodal function by successively narrowing the range of values inside which the extremum is known to exist. The technique derives its name from the fact… …   Wikipedia

  • Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… …   Wikipedia

  • Quiescence search — is an algorithm typically used to evaluate minimax game trees in game playing computer programs. It is a remedy for the horizon problem faced by AI engines for various games like chess and Go.The horizon effectThe horizon effect is a problem in… …   Wikipedia

  • Alpha-beta pruning — is a search algorithm which seeks to reduce the number of nodes that are evaluated in the search tree by the minimax algorithm. It is a search with adversary algorithm used commonly for machine playing of two player games (Tic tac toe, Chess, Go …   Wikipedia

  • Negamax — search is a slightly variant formulation of minimax search that relies on the zero sum property of a two player game. An animated pedagogical example showing the plain negamax algorithm (that is, without alpha beta pruning). The person performing …   Wikipedia

  • Computer chess — 1990s Pressure sensory chess computer with LCD screen Chess+ For the iPad …   Wikipedia

  • MTD-f — MTD(f), an abbreviation of MTD(n,f) (Memory enhanced Test Driver with node n and value f) is a minimax search algorithm better than the basic alpha beta pruning algorithm. Zero Window Searches MTD(f) efficiently does only zero window alpha beta… …   Wikipedia

  • Game complexity — Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state space complexity, game tree size, decision complexity, game tree complexity, and computational complexity. Contents 1 Measures of… …   Wikipedia

  • MTD — may refer to:*An unemployed workers movement of Argentina (Spanish Movimiento de Trabajadores Desocupados ) mdash; see Piquetero ; *A mass transit district, such as the Champaign Urbana Mass Transit District or the Metropolitan Transit District;… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»